Function classes for successful DE-Sinc approximations

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Function classes for successful DE-Sinc approximations

The DE-Sinc formulas, resulting from a combination of the Sinc approximation formula with the double exponential (DE) transformation, provide a highly efficient method for function approximation. In many cases they are more efficient than the SE-Sinc formulas, which are the Sinc approximation formulas combined with the single exponential (SE) transformations. Function classes suited to the SE-S...

متن کامل

Learning classes of approximations to non-recursive function

Blum and Blum (1975) showed that a class B of suitable recursive approximations to the halting problem K is reliably EX-learnable but left it open whether or not B is in NUM. By showing B to be not in NUM we resolve this old problem. Moreover, variants of this problem obtained by approximating any given recur-sively enumerable set A instead of the halting problem K are studied. All correspondin...

متن کامل

Approximations to Permutation Classes

We investigate a new notion of approximately avoiding a permutation: π almost avoids β if one can remove a single entry from π to obtain a β-avoiding permutation.

متن کامل

Sinc-Approximations of Fractional Operators: A Computing Approach

We discuss a new approach to represent fractional operators by Sinc approximation using convolution integrals. A spin off of the convolution representation is an effective inverse Laplace transform. Several examples demonstrate the application of the method to different practical problems.

متن کامل

On Divergence of Sinc - Approximations Everywhere on ( 0 , Π )

Some properties of sinc-approximations of continuous functions on a segment are studied. For the first time, the sinc-approximations arose in the work of Pleynet. Later, in connection with developments in signals coding theory, E. Borel and E. T. Whittaker introduced the notions of a cardinal function and a truncated cardinal function, the restriction of which to [0, π] looks like this:

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Mathematics of Computation

سال: 2009

ISSN: 0025-5718,1088-6842

DOI: 10.1090/s0025-5718-08-02196-0